《網上考試系統》是一款基于Web、采用B/S體系的考試系統軟件。系統體現流程思想。無論是考試計劃還是新聞的發(fā)布都需要通過層層審批才能生效，審批流程，系統自動提示，無需主動尋找
上傳時間： 2014-01-13
上傳用戶：stvnash
Bing is a point-to-point bandwidth measurement tool (hence the b ), based on ping. Bing determines the real (raw, as opposed to available or average) throughput on a link by measuring ICMP echo requests roundtrip times for different packet sizes for each end of the link
標簽： Bing point-to-point measurement determines
上傳時間： 2015-09-15
上傳用戶：lgnf
The task of clustering Web sessions is to group Web sessions based on similarity and consists of maximizing the intra- group similarity while minimizing the inter-group similarity． The first and foremost question needed to be considered in clustering W b sessions is how to measure the similarity between Web sessions．However．there are many shortcomings in traditiona1 measurements．This paper introduces a new method for measuring similarities between Web pages that takes into account not only the URL but also the viewing time of the visited web page．Yhen we give a new method to measure the similarity of Web sessions using sequence alignment and the similarity of W eb page access in detail Experiments have proved that our method is valid and e幣cient．
標簽： sessions clustering similarity Web
上傳時間： 2014-01-11
上傳用戶：songrui
tiny Web-server based on OpenTCP for MB90F497 Fujitsu and CS8900A Etnernet driver
標簽： Web-server Etnernet OpenTCP Fujitsu
上傳時間： 2015-01-21
上傳用戶：冇尾飛鉈
~{JGR 8vQ IzWwR5SC5D2V?bD#DbO5M3~} ~{3v?b~} ~{Hk?b~} ~{2iQ/5H9&D\~} ~{?IRTWw@)3d~} ~{TZ~}JDK1.4.2~{OBM(9}~}
上傳時間： 2015-02-22
上傳用戶：ommshaggar
b to b 模式 電子商務系統 ，c# 開發(fā) , B/S結構
上傳時間： 2014-01-20
上傳用戶：hanli8870
A Java web application, based on Struts and Hibernate, that serves as an online running log. Users may enter information about workouts, and can track historical performance and data using web-based charts.
標簽： application Hibernate running Struts
上傳時間： 2015-09-08
上傳用戶：weixiao99
樣板 B 樹 ( B - tree ) 規(guī)則 : (1) 每個節(jié)點內元素個數在 [MIN,2*MIN] 之間, 但根節(jié)點元素個數為 [1,2*MIN] (2) 節(jié)點內元素由小排到大, 元素不重複 (3) 每個節(jié)點內的指標個數為元素個數加一 (4) 第 i 個指標所指向的子節(jié)點內的所有元素值皆小於父節(jié)點的第 i 個元素 (5) B 樹內的所有末端節(jié)點深度一樣
上傳時間： 2017-05-14
上傳用戶：日光微瀾
歐幾里德算法：輾轉求余 原理: gcd(a,b)=gcd(b,a mod b) 當b為0時,兩數的最大公約數即為a getchar()會接受前一個scanf的回車符
上傳時間： 2014-01-10
上傳用戶：2467478207
數據結構課程設計 數據結構B+樹 B+ tree Library
上傳時間： 2013-12-31
上傳用戶：semi1981
